Query Containment With Negated IDB Predicates (Extended Version)
نویسندگان
چکیده
We present a method that checks Query Containment for queries with negated IDB predicates. Existing methods either deal only with restricted cases of negation or do not check actually containment but uniform containment, which is a sufficient but not necessary condition for containment. Additionally, our queries may also contain equality, inequality and order comparisons. The generality of our approach allows our method to deal straightforwardly with query containment under constraints. Our method is sound and complete both for success and for failure and we characterize the databases where these properties hold. We also state the class of queries that can be decided by our method.
منابع مشابه
The Constructive Method for Query Containment Checking ( extended version )
We present a new method that checks Query Containment for queries with negated derived atoms and/or integrity constraints. Existing methods for Query Containment checking that deal with these cases do not check actually containment but another related property called uniform containment, which is a sufficient but not necessary condition for containment. Our method can be seen as an extension of...
متن کاملThe Database Approach to Knowledge Represention
The database theory community, centered around the PODS Principles of Database Systems conference has had a long-term interest in logic as a way to represent data," information," and knowledge" take your pick on the term | it boils down to facts or atoms and rules, usually Horn clauses. The approach of this community has been slow and steady," preferring to build up carefully from simple specia...
متن کاملBoolean Tensor Decomposition for Conjunctive Queries with Negation
We propose an algorithm for answering conjunctive queries with negation, where the negated relations are sparse. Its data complexity matches that of the best known algorithms for the positive subquery of the input query and is expressed in terms of the fractional hypertree width and the submodular width. The query complexity depends on the structure of the negated subquery; in general it is exp...
متن کاملDetermining Correct View Update Translations via Query Containment
Given an intensional database (IDB) and an extension database (EDB), the view update problem translates updates on the IDB into updates on the EDB. One approach to the view update problem uses a translation langauge to specify the meaning of a view update. In this paper we prove properties of a translation language. This approach to the view update problem studies the expressive power of the tr...
متن کاملScalable template-based query containment checking for web semantic caches
Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data on edge servers. Such caches require fast query containment tests to determine if a new query is contained in the results of cached queries. Query containment checking algorithms have been studied in the context of qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003